Zero Queueing for Multi-Server Jobs
نویسندگان
چکیده
Cloud computing today is dominated by multi-server jobs. These are jobs that request multiple servers simultaneously and hold onto all of these for the duration job. Multi-server add a lot complexity to traditional one-server-per-job model: an arrival might not "fit'' into available have queue, blocking later arrivals leaving idle. From queueing perspective, almost nothing understood about job systems; even understanding exact stability region very hard problem. In this paper, we investigate model under scaling regimes where number in system grows. Specifically, consider with classes jobs, from different can numbers service time distributions, served first-come-first-served order. The opens up new both needs load scale total servers. Within regimes, derive first results on stability, probability, transient analysis each class. particular sufficient conditions zero queueing. Our introduces novel way extracting information Lyapunov drift, which be applicable broader scope problems systems.
منابع مشابه
Discrete Time Analysis of Multi-Server Queueing System with Multiple Working Vacations and Reneging of Customers
This paper analyzes a discrete-time $Geo/Geo/c$ queueing system with multiple working vacations and reneging in which customers arrive according to a geometric process. As soon as the system gets empty, the servers go to a working vacations all together. The service times during regular busy period, working vacation period and vacation times are assumed to be geometrically distributed. Customer...
متن کاملA multi - server queueing model with
In this paper we analyse a multi-server queueing model with locking. The model is motivated by a situation we encountered at a maintenance facility for trains. Maintenance is done at parallel tracks, where each track ooers space to two trains. Trains can enter and leave the tracks from one and the same side only. This gives rise to locking of the front train: in order to leave the maintenance t...
متن کاملBuffer and server allocation in general multi-server queueing networks
This paper deals with the joint optimization of the number of buffers and servers, an important issue since buffers and servers represent a significant amount of investment for many companies. The joint buffer and server optimization problem (BCAP) is a non-linear optimization problem with integer decision variables. The performance of the BCAP is evaluated by a combination of a two-moment appr...
متن کاملOptimal Server Allocation in General, Finite, Multi-Server Queueing Networks
Queueing networks with finite buffers, multiple servers, arbitrary acyclic, series-parallel topologies, and general service time distributions are considered in this paper. An approach to optimally allocate servers to series, merge, and split topologies and their combinations is demonstrated. The methodology builds upon two-moment approximations to the service time distribution embedded in the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ACM on measurement and analysis of computing systems
سال: 2021
ISSN: ['2476-1249']
DOI: https://doi.org/10.1145/3447385